A Simple Linear Time LexBFS Cograph Recognition Algorithm
نویسندگان
چکیده
منابع مشابه
A Simple Linear Time LexBFS Cograph Recognition Algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for various families of graphs. In this paper, we add to this work by producing a simple two LexBFS sweep algorithm to recognize the family of cographs. This algorithm extends to other related graph families such as P4-red...
متن کاملA simple linear time algorithm for cograph recognition
In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P4-free graphs (where P4 denotes the path with 4 vertices). The recognition process works in two steps. First, we use partition refinement techniques to produce a factorizing permutation, i.e., an ordering of the vertices in which the strong modules appear consecutively. Then a very sim...
متن کاملParallel Algorithm for Cograph Recognition with Applications
We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log 2 n) time with O(n + m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain parallel algorithms for solving the maximum matching and the permutation representation problems for cographs using O(logn) tim...
متن کاملA Simple Linear-Time Modular Decomposition Algorithm
The first polynomial time algorithm (O(n)) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear-time algorithms [22, 7, 23, 9]. Although having optimal time complexity these algorithms are quite complicated and difficult to implement. In this paper we present an easily implementable linear-time algorithm for modul...
متن کاملCograph Recognition Algorithm Revisited and Online Induced P4 Search
In 1985, Corneil, Perl and Stewart CPS85] gave a linear incremental algorithm to recognize cographs (graphs with no induced P4). When this algorithm stops, either the initial graph is a cograph and the cotree of the whole graph has been built, or the initial graph is not a cograph and this algorithm ends up with a vertex v and a cotree cot such that v cannot be inserted in cot; so the input gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2008
ISSN: 0895-4801,1095-7146
DOI: 10.1137/060664690